mega: Towards a Mathematical Assistant

نویسندگان

  • Lassaad Cheikhrouhou
  • Detlef Fehrer
  • Armin Fiedler
  • Xiaorong Huang
  • Manfred Kerber
  • Michael Kohlhase
  • Karsten Konrad
  • Andreas Meier
  • Erica Melis
  • Wolf Schaarschmidt
  • Volker Sorge
چکیده

mega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an integrated collection of tools for formulating problems, proving subproblems, and proof presentation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Tps with mega

We report on the integration of Tps as an external reasoning component into the mathematical assistant system mega. Thereby Tps can be used both as an automatic theorem prover for higher order logic as well as interactively employed from within the mega environment. Tps proofs can be directly incorporated into mega on a tactic level enabling their visualization and verbalization. Using an examp...

متن کامل

Towards Using i* for Modeling Mega-Urban Processes

In this paper, we consider the use of i* for modelling social networks in the context of mega-urbanization and water resources. In particular, we discuss, mostly by way of example, issues that are special to this domain such as the need to explicitly model nature or a new kind of agent evolution. Another important issue is the usability of i* by scientists from different disciplines to model me...

متن کامل

Integrating Tps and Omega

This paper reports on the integration of the higher-order theorem proving environment Tps [Andrews et al., 1996] into the mathematical assistant mega [Benzm uller et al., 1997]. Tps can be called from mega either as a black box or as an interactive system. In black box mode, the user has control over the parameters which control proof search inTps; in interactive mode, all features of theTps-s...

متن کامل

Computer Supported Mathematics with ΩMEGA

Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces—often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to mor...

متن کامل

Proof Development with Ω mega : √ 2 Is Irrational

Freek Wiedijk proposed the well-known theorem about the irrationality of √ 2 as a case study and used this theorem for a comparison of fifteen (interactive) theorem proving systems, which were asked to present their solution (see [48]). This represents an important shift of emphasis in the field of automated deduction away from the somehow artificial problems of the past as represented, for exa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997